Means for parameterization of exemplar queries
نویسندگان
چکیده
منابع مشابه
Error-tolerant Exemplar Queries on RDF Graphs
Edge-labeled graphs are widely used to describe relationships between entities in a database. We study a class of queries, referred to as exemplar queries, on edge-labeled graphs where each query gives an example of what the user is searching for. Given an exemplar query, we study the problem of efficiently searching for similar subgraphs in a large data graph, where the similarity is defined i...
متن کاملExemplar Queries: Give me an Example of What You Need
Search engines are continuously employing advanced techniques that aim to capture user intentions and provide results that go beyond the data that simply satisfy the query conditions. Examples include the personalized results, related searches, similarity search, popular and relaxed queries. In this work we introduce a novel query paradigm that considers a user query as an example of the data i...
متن کاملOesophageal voice acoustic parameterization by means of optimum shimmer calculation
This paper presents an algorithm which works with oesophageal voice and aims to automatically calculate different measurements of shimmer parameter. The evaluation has required a novel processing for the detection of the periodicity cycles and instants in order to calculate amplitude perturbations of vocal signals. The designed algorithm performs the calculusof pitch in an automatic way with a ...
متن کاملStreaming Algorithms for k-Means Clustering with Fast Queries
We present methods for k-means clustering on a stream with a focus on providing fast responses to clustering queries. When compared with the current state-of-the-art, our methods provide a substantial improvement in the time to answer a query for cluster centers, while retaining the desirable properties of provably small approximation error, and low space usage. Our algorithms are based on a no...
متن کاملApproximation of Frequency Queries by Means of Free-Sets
Given a large collection of transactions containing items, a basic common data mining problem is to extract the so-called frequent itemsets (i.e., set of items appearing in at least a given number of transactions). In this paper, we propose a structure called free-sets, from which we can approximate any itemset support (i.e., the number of transactions containing the itemset) and we formalize t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2018
ISSN: 1877-0509
DOI: 10.1016/j.procs.2018.11.059